Natural Conjugate Gradient on Complex Flag Manifolds for Complex Independent Subspace Analysis

نویسندگان

  • Yasunori Nishimori
  • Shotaro Akaho
  • Mark D. Plumbley
چکیده

We study the problem of complex-valued independent subspace analysis (ISA). We introduce complex flag manifolds to tackle this problem, and, based on Riemannian geometry, propose the natural conjugate gradient method on this class of manifolds. Numerical experiments demonstrate that the natural conjugate gradient method yields better convergence compared to the natural gradient geodesic search method.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Riemannian Optimization Method on the Flag Manifold for Independent Subspace Analysis

Recent authors have investigated the use of manifolds and Lie group methods for independent component analysis (ICA), including the Stiefel and the Grassmann manifolds and the orthogonal group O(n). In this paper we introduce a new class of manifold, the generalized flag manifold, which is suitable for independent subspace analysis. The generalized flag manifold is a set of subspaces which are ...

متن کامل

Steepest descent on real flag manifolds

Among the compact homogeneous spaces, a very distinguished subclass is formed by the (generalized) real flag manifolds which by definition are the orbits of the isotropy representations of Riemannian symmetric spaces (sorbits). This class contains most compact symmetric spaces (e.g. all hermitian ones), all classical flag manifolds over real, complex and quaternionic vector spaces, all adjoint ...

متن کامل

Geodesic Learning Algorithms Over Flag Manifolds

Recently manifold structures have attracted attentions in two folds in the machine learning literature. One is in the manifold learning problem, that is learning the intrinsic manifold structure in high dimensional datasets. Another is in the information geometric approach to learning – exploiting the geometry of the parameter space of learning machines such as neural networks for improving con...

متن کامل

A New Hybrid Conjugate Gradient Method Based on Eigenvalue Analysis for Unconstrained Optimization Problems

In this paper‎, ‎two extended three-term conjugate gradient methods based on the Liu-Storey ({tt LS})‎ ‎conjugate gradient method are presented to solve unconstrained optimization problems‎. ‎A remarkable property of the proposed methods is that the search direction always satisfies‎ ‎the sufficient descent condition independent of line search method‎, ‎based on eigenvalue analysis‎. ‎The globa...

متن کامل

Crack Detection In Functionally Graded Beams Using Conjugate Gradient Method

In this paper the conjugate gradient (CG) method is employed for identifying the parameters of crack in a functionally graded beam from natural frequency measurement. The crack is modeled as a massless rotational spring with sectional flexibility. By using the Euler-Bernoulli beam theory on two separate beams respectively and applying the compatibility requirements of the crack, the characteris...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008